Algebraic Relations for Recursive Sequences
نویسنده
چکیده
Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation an+1 = Aan + Ban−1, by means of algebraic equations in two variables of degree n ∈ N . We do this, as far as we know, like it has never been formalized before. I’d like to precise that the work was develop without the support of any well-know results about difference equations. Recently I discover that the present work has been treated already, but in a different context, at least in the two books [Car] and [Ela]. Never the less, I found it is a good idea to publish it. It would be a simple and ready-to-use instrument to they aren’t familiar with difference equations.
منابع مشابه
A Novel Reference Current Calculation Method for Shunt Active Power Filters using a Recursive Algebraic Approach
This paper presents a novel method to calculate the reference source current and the referencecompensating current for shunt active power filters (SAPFs). This method first calculates theamplitude and phase of the fundamental load current from a recursive algebraic approach blockbefore calculating the displacement power factor. Next, the amplitude of the reference mains currentis computed with ...
متن کاملRecursive types to D∞ and beyond
The paper presents an analysis of the interpretation of recursive types as logical relations in the framework of iterative algebraic theories. This allows a smoother presentation of the underlying technique, and easier proofs of properties of the interpretation.
متن کاملAn Algebraic Approach to the Interpretation of Recursive Types
We present an algebraic framework for the interpretation of type systems including type recursion, where types are interpreted as partial equivalence relations over a Scott domain. We use the notion of iterative algebra, introduced by J. Tiuryn [26] as a counterpart to the categorical notion of iterative algebraic theory by C.C. Elgot [15]. We show that a suitable collection of partial equivale...
متن کاملAIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems
The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...
متن کاملOn the Algebraic Relations between Mahler Functions
In the last years, a number of authors have studied the algebraic relations between the generating series of automatic sequences. It turns out that these series are solutions of Mahler type equations. This paper is mainly concerned with the difference Galois groups of Mahler type equations (these groups reflect the algebraic relations between the solutions of the equations). In particular, we s...
متن کامل